Technical Note—On Intersection Cuts in Interval Integer Linear Programming
نویسندگان
چکیده
منابع مشابه
Natural Intersection Cuts for Mixed-Integer Linear Programs
Intersection cuts are a family of cutting planes for pure and mixedinteger linear programs, developed in the 1970s. Most papers on them consider only cuts that come from so-called maximal lattice-point-free polyhedra. We define a completely different family of intersection cuts, called “natural”. Their key property is that they can be generated very quickly and easily from a simplex tableau. In...
متن کاملCombinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP’s) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and analyze computationally an automatic problem reformulation of quite general applicability, aimed at removing the model dependency on the big-M coefficients. Our solution scheme defines a master Integer Linear Problem (ILP) wi...
متن کاملFirst step immersion in interval linear programming with linear dependencies
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classi...
متن کاملIntersection cuts for nonlinear integer programming: convexification techniques for structured sets
We study the generalization of split and intersection cuts from Mixed Integer Linear Programming to the realm of Mixed Integer Nonlinear Programming. Constructing such cuts requires calculating the convex hull of the difference of two convex sets with specific geometric structures. We introduce two techniques to give precise characterizations of such convex hulls and use them to construct split...
متن کاملSpherical cuts for integer programming problems
Abstract We introduce a new family of valid inequalities for general linear integer programming problems, based on the distance of the relaxed solution to the closest integral point. We show that these are valid cuts, establish some relations with Balas’ intersection cuts, and show that a straightforward cutting plane algorithm derived from either spherical or intersection cuts will in general ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1977
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.25.2.352